Effectiveness and safety of co-administration of moxifloxacin with netilmicin in drug-resistant tuberculosis patients, and its impact on inflammatory factors and immune function

Purpose: To study the effectiveness and safety of co-administration of moxifloxacin with netilmicin in drug-resistant tuberculosis (TB) patients, and its impact on levels of inflammatory factors and immune function. Methods: We enrolled 100 patients with drug-resistant TB admitted to People’s Hospital of Rizhao between May 2017 and October 2019. The patients were randomly allocated to control group and study group, with 50 patients per group. The control group received moxifloxacin at a dose of 0.2 g t.i.d. for 6 months and the study group received netilmicin at a dose of 0.1 g t.i.d. plus. The response, incidence of adverse reactions, expression levels of inflammatory factors, immune function, and sputum-negative status after 2, 4 and 6 months of TB treatment were compared. Results: The study group showed markedly higher response than the control group (p < 0.05). Moreover, there were lower incidence of adverse effects in the study group than in the control group (p < 0.05). The expression levels of inflammatory factors were significantly lower in the study group, while the concentrations of CD3+, CD4+, and CD8+ were markedly higher (p < 0.05). After 2, 4 and 6 months of TB treatment, cases of sputum-negative conversion were significantly higher in the study group than in the control group (p < 0.05). Conclusion: Co-administration of moxifloxacin with netilmicin produces much higher effectiveness and safety than moxifloxacin monotherapy, decreases inflammatory factor levels and improves immune function in patients with drug-resistant TB

Improving the Gilbert-Varshamov Bound by Graph Spectral Method

We improve Gilbert-Varshamov bound by graph spectral method. Gilbert graph $G_{q,n,d}$ is a graph with all vectors in $\mathbb{F}_q^n$ as vertices where two vertices are adjacent if their Hamming distance is less than $d$. In this paper, we calculate the eigenvalues and eigenvectors of $G_{q,n,d}$ using the properties of Cayley graph. The improved bound is associated with the minimum eigenvalue of the graph. Finally we give an algorithm to calculate the bound and linear codes which satisfy the bound

Clinical analysis of vulvar cancer

Background: The purpose of this study is to understand the incidence, related factors, and the prognosis factors in order to avoid risk, proper method of diagnosis and treatment and reduce complications and provide the basis.Methods: 85 Vulvar cancer (VC) patients treated in our hospital from 2002.10 to 2012.10 were collected and analyzed by retrospective comparative methods. SPSS19.0 application software was used for the statistical analysis. The clinical data are analyzed by chi-square and F test statistic methods. P < 0.05 was a significant difference between the judgment standard.Results: During 10 years, we treated 3391 cases of the primary malignant tumors including 85 VC cases; VC was 2.89% (85/3391). The age was between 24～88 years old, mean was 57.09±12.93 yrs. old, variable age of the VC had been juvenescence trend (F=6. 013，P=0.016＜0.05＝). The differences between the urban and rural residential area have some influence to the onset of VC. Rural patients are more than urban patients. By statistical analysis, region distribution in these two groups was remarkably different=4.16，P=0.045＜0.05, but the urban proportion of patients in different years has no difference（χ2=0.080, P=0.777）.Conclusion: The number of cases increased progressively in young age. VC patients were more in rural area than urban. History of malignant tumor and obesity has the positive correlation with VC. High-risk groups should be alert to the possibility of VC. Preoperative diagnosis should be Colposcopic, biopsy in order to improve the accuracy of earlier diagnosis. Vulvar resects have an effect on the healing of the incision. Follow-up rate is low; It is difficult to say statistically survival rate is 5 years

On the Weight Spectrum Improvement of Pre-transformed Reed-Muller Codes and Polar Codes

Pre-transformation with an upper-triangular matrix (including cyclic redundancy check (CRC), parity-check (PC) and polarization-adjusted convolutional (PAC) codes) improves the weight spectrum of Reed-Muller (RM) codes and polar codes significantly. However, a theoretical analysis to quantify the improvement is missing. In this paper, we provide asymptotic analysis on the number of low-weight codewords of the original and pre-transformed RM codes respectively, and prove that pre-transformation significantly reduces low-weight codewords, even in the order sense. For polar codes, we prove that the average number of minimum-weight codewords does not increase after pre-transformation. Both results confirm the advantages of pre-transformation

On the Weight Distribution of Weights Less than 2wmin⁡2w_{\min} in Polar Codes

The number of low-weight codewords is critical to the performance of error-correcting codes. In 1970, Kasami and Tokura characterized the codewords of Reed-Muller (RM) codes whose weights are less than $2w_{\min}$, where $w_{\min}$ represents the minimum weight. In this paper, we extend their results to decreasing polar codes. We present the closed-form expressions for the number of codewords in decreasing polar codes with weights less than $2w_{\min}$. Moreover, the proposed enumeration algorithm runs in polynomial time with respect to the code length